com.mindfusion.graphs.Graph.planarize Method (HashMap<Edge, ArrayList<Edge>>)

Graph.planarize Method (HashMap<Edge, ArrayList<Edge>>)

See Also

Java

Introduction

General Information

What's New in this Release

Version History

Getting Started

User Interaction

Programming Interface Overview

Tutorials

Reference

com.mindfusion.common

com.mindfusion.diagramming

com.mindfusion.diagramming.builders

com.mindfusion.diagramming.components

com.mindfusion.diagramming.export

com.mindfusion.diagramming.importers

com.mindfusion.diagramming.jlayout

com.mindfusion.diagramming.lanes

com.mindfusion.drawing

com.mindfusion.graphs

Attribute Class

Bend Class

BimodalSplit Class

BinaryTree<T> Class

BlockCutpointGraph Class

Cell Class

CircularDrawing Class

ComponentBlocksHandler Interface

ConstrainedVisibility Class

DatabaseDrawing Class

DrawingGrid Class

DualGraph Class

Edge Class

EdgeShape Class

Embedding Class

Face Class

FractalDrawing Class

Graph Class

Graph Members

Graph Fields

Graph Constructor

Graph Methods

addEdge Method

addVertex Method

addVertexAndOutEdges Method

allPairShortestPaths Method

assignTreeLevels Method

bestTreeRoot Method

coarsen Method

containsRepeatedEdges Method

contractEdge Method

convertToStGraph Method

convertToStGraphVirtualEnds Method

createReverseMaps Method

depthFirstSearch Method

eliminateIntermediateSourcesAndSinks Method

embedOnSameFace Method

father Method

findPlanarSubgraph Method

findPlanarSubgraphByBookEmbedding Method

findPlanarSubgraphBySimpleEdgeInsertion Method

findShortestPath Method

findShortestWeightedPath Method

getBiconnectedComponents Method

getCanonicalOrder Method

getConnectedComponents Method

getConnectedComponentsQuickFind Method

getConnectedComponentsQuickUnion Method

getDualGraph Method

getEdgeConnectedComponents Method

getEdges Method

getLayers Method

getLevelPlanarEmbedding Method

getPlanarEmbedding Method

getStNumbering Method

getTreeChildren Method

getVertices Method

getWeightedTopologicalNumbering Method

isAcyclic Method

isPlanar Method

isProperHierarchical Method

isTree Method

load Method

loadMappings Method

makeAcyclic Method

makeBiconnected Method

makeBimodal Method

makeProperHierarchical Method

makeStPlanar Method

maximalMatching Method

maxWeightedCliqueOfTransitiveDAG Method

minCostPathOrNegativeCycle Method

optimalTopologicalNumbering Method

partition Method

partitionTree Method

planarize Method

planarize Method (HashMap<Edge, ArrayList<Edge>>)

planarize Method (HashMap<Edge, ArrayList<Edge>>, Collection<Edge>)

planarMakeBiconnected Method

removeAllEdges Method

removeEdge Method

removeVertex Method

reorderTopologically Method

reverse Method

save Method

saveMappings Method

splitToMaxDegree Method

topologicalSort Method

toString Method

triangulate Method

GridDrawing Class

HierarchicalDrawing Class

HierarchicalEmbedding Class

Interval Class

IntervalGraph Class

LayoutTraits Class

MinBendOrthogonalDrawing Class

Network Class

Node Class

NodePair Class

OrthogonalDrawing Class

OrthogonalRepresentation Class

OverlapGraph Class

Point Class

PointD Class

PointF Class

PolylineDrawing Class

PQTree<T> Class

QuasiUpwardDrawing Class

Representation Class

Set<T> Class

Size Class

StConversion Class

StEmbedding Class

StPlanarization Class

Table Class

Tessellation Class

Utilities Class

Vertex Class

VertexExchangeGraph Class

VertexSizeFunction Interface

Visibility Class

com.mindfusion.pdf

com.mindfusion.scripting

com.mindfusion.svg

Table of Predefined Shapes

Licensing

Online Resources

Technical Support

MindFusion Products

Namespace: com.mindfusion.graphs
Package: com.mindfusion.graphs

Syntax

Java Copy Code
public Graph planarize ( HashMap<Edge, ArrayList<Edge>> edgeToDummyEdgesMap )

Parameters

edgeToDummyEdgesMap

Syntax

Parameters

Return Value

See Also